Factorization Systems and Adjunctions

نویسندگان

  • D. ZANGURASHVILI
  • C. Cassidy
  • M. Hebert
چکیده

Several results on the translation of factorization systems along adjunctions are proved. The first of these results is the answer to the question posed by G.Janelidze.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

From torsion theories to closure operators and factorization systems

Torsion theories are here extended to categories equipped with an ideal of 'null morphisms', or equivalently a full subcategory of 'null objects'. Instances of this extension include closure operators viewed as generalised torsion theories in a 'category of pairs', and factorization systems viewed as torsion theories in a category of morphisms. The first point has essentially been treated in [15].

متن کامل

On the WZ Factorization of the Real and Integer Matrices

The textit{QIF}  (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ}  factorization. The  WZ factorization can be faster than the textit{LU} factorization  because,  it performs the simultaneous evaluation of two columns or two rows. Here, we present a  method for computing the real and integer textit{WZ} and  textit{ZW} factoriz...

متن کامل

Homotopical Methods for Theoretical Computer Science

The purpose of this paper is to collect the homotopical methods used in the development of the theory of flows initialized by author’s paper “A model category for the homotopy theory of concurrency”. It is presented generalizations of the classical Whitehead theorem inverting weak homotopy equivalences between CW-complexes using weak factorization systems. It is also presented methods of calcul...

متن کامل

WZ factorization via Abay-Broyden-Spedicato algorithms

Classes of‎ ‎Abaffy-Broyden-Spedicato (ABS) methods have been introduced for‎ ‎solving linear systems of equations‎. ‎The algorithms are powerful methods for developing matrix‎ ‎factorizations and many fundamental numerical linear algebra processes‎. ‎Here‎, ‎we show how to apply the ABS algorithms to devise algorithms to compute the WZ and ZW‎ ‎factorizations of a nonsingular matrix as well as...

متن کامل

Applications of the Kleisli and Eilenberg-Moore 2-adjunctions

In 2010, J. Climent Vidal and J. Soliveres Tur developed, among other things, a pair of 2-adjunctions between the 2-category of adjunctions and the 2-category of monads. One is related to the Kleisli adjunction and the other to the Eilenberg-Moore adjunction for a given monad.Since any 2-adjunction induces certain natural isomorphisms of categories, these can be used to classify bijection...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002